Automatic clustering of collocation for detecting practical sense boundary
نویسندگان
چکیده
This paper talks about the deciding practical sense boundary of homonymous words. The important problem in dictionaries or thesauri is the confusion of the sense boundary by each resource. This also becomes a bottleneck in the practical language processing systems. This paper proposes the method about discovering sense boundary using the collocation from the large corpora and the clustering methods. In the experiments, the proposed methods show the similar results with the sense boundary from a corpus-based dictionary and sense-tagged corpus.
منابع مشابه
The Sense Boundary Decision and the Sense Labeling from Collocation Clustering
This paper discusses the deciding practical sense boundary of homonymous words. One of the serious problems in making dictionaries or thesauri is in the vague boundary of senses. This also becomes a bottleneck in sense disambiguation for practical language processing systems. This paper proposes a deciding method for sense boundary discovery of homonyms using collocation from large corpora and ...
متن کاملWord Sense Induction: Triplet-Based Clustering and Automatic Evaluation
In this paper a novel solution to automatic and unsupervised word sense induction (WSI) is introduced. It represents an instantiation of the ‘one sense per collocation’ observation (Gale et al., 1992). Like most existing approaches it utilizes clustering of word co-occurrences. This approach differs from other approaches to WSI in that it enhances the effect of the one sense per collocation obs...
متن کاملA New Modification of Legendre-Gauss Collocation Method for Solving a Class of Fractional Optimal Control Problems
In this paper, the optimal conditions for fractional optimal control problems (FOCPs) were derived in which the fractional differential operators defined in terms of Caputo sense and reduces this problem to a system of fractional differential equations (FDEs) that is called twopoint boundary value (TPBV) problem. An approximate solution of this problem is constructed by using the Legendre-Gauss...
متن کاملSPLINE COLLOCATION METHOD FOR SOLVING BOUNDARY VALUE PROBLEMS
The spline collocation method is used to approximate solutions of boundary value problems. The convergence analysis is given and the method is shown to have second-order convergence. A numerical illustration is given to show the pertinent features of the technique.
متن کاملCollocation Lattices and Maximum Entropy Models
Maximum entropy framework proved to be expressive and powerful for the statistical language modelling, but it suffers from the computational expensiveness of the model building. The iterative scaling algorithm that is used for the parameter estimation is computationally expensive while the feature selection process requires to estimate parameters of the model for many candidate features many ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004